Active set expansion strategies in MPRGP algorithm
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm to Set Active Contour
Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an active contour is implemented using a greedy algorithm. Within this framework, two approaches are presented. A supervised approach which delivers a global set of parameters. In this case the greedy algorithm is invol...
متن کاملMonotonicity and Active Set Strategies in Probabilistic Design Optimization
Probabilistic design optimization addresses the presence of uncertainty in design problems. Extensive studies on reliability-based design optimization, i.e., problems with random variables and probabilistic constraints, have focused on improving computational efficiency of estimating values for the probabilistic functions. In the presence of many probabilistic inequality constraints, computatio...
متن کاملOn Set Expansion Problems and the Small Set Expansion Conjecture
We study two problems related to the Small Set Expansion Conjecture [14]: the Maximum weight m′-edge cover (MWEC ) problem and the Fixed cost minimum edge cover (FCEC ) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at ...
متن کاملOn Set Expansion Problems and the Small Set Expansion
We study two problems related to the Small Set Expansion Conjecture [15]: the Maximum weight m′-edge cover (MWEC) problem and the Fixed cost minimum edge cover (FCEC) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at mo...
متن کاملA New Active Set Algorithm for Box Constrained Optimization
An active set algorithm (ASA) for box constrained optimization is developed. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for branching between the two steps. Global convergence to a stationary point is established. For a nondegenerate stationary point, the algorithm eventually reduces to unconstrained optimization with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Engineering Software
سال: 2020
ISSN: 0965-9978
DOI: 10.1016/j.advengsoft.2020.102895